On the Cocircuit Graph of an Oriented Matroid
نویسندگان
چکیده
In this paper we consider the cocircuit graph G M of an oriented matroid M, the 1-skeleton of the cell complex W formed by the span of the cocircuits of M. In general, W is not determined by G M. However, we show that if the vertex set resp. edge set] of G M is properly labeled by the hyperplanes resp. colines] of M, G M determines W. Also we prove that, when M is uniform, the cocicuit graph together with all antipodal pairs of vertices being marked determines W. These results can be considered as variations of Blind-Mani's theorem that says the one skeleton of a simple convex polytope determines its face lattice.
منابع مشابه
Polynomial Time Recognition of Uniform Cocircuit Graphs
We present an algorithm which takes a graph as input and decides in polynomial time if the graph is the cocircuit graph of a uniform oriented matroid. In the affirmative case the algorithm returns the set of signed cocircuits of the oriented matroid.
متن کاملCubic time recognition of cocircuit graphs of uniform oriented matroids
We present an algorithm which takes a graph as input and decides in cubic time if the graph is the cocircuit graph of a uniform oriented matroid. In the affirmative case the algorithm returns the set of signed cocircuits of the oriented matroid. This improves an algorithm proposed by Babson, Finschi and Fukuda. Moreover we strengthen a result of Montellano-Ballesteros and Strausz about crabbed ...
متن کاملA graph-theoretical axiomatization of oriented matroids
We characterize which systems of sign vectors are the cocircuits of an oriented matroid in terms of the cocircuit graph.
متن کاملA characterization of cocircuit graphs of uniform oriented matroids
The cocircuit graph of an oriented matroid is the 1-skeleton of the cellular decomposition induced by the Topological Representation Theorem due to Folkman and Lawrence (1978) [J. Folkman, J. Lawrence, Oriented matroids, J. Combin. Theory Ser. B 25 (1978) 199–236]. In this paper we exhibit a characterization of such graphs (for the uniform case) via their natural embedding into Qn—the 1-skeleto...
متن کاملOn the Number of Circuit-cocircuit Reversal Classes of an Oriented Matroid
Gioan introduced the circuit-cocircuit reversal system of an oriented matroid and showed that its cardinality equals the number of bases when the underlying matroid is regular. We prove that the equality fails whenever the underlying matroid is not regular, hence giving a new characterization of regular matroids.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete & Computational Geometry
دوره 24 شماره
صفحات -
تاریخ انتشار 2000